On strongly regular graphs with μ≤2BAGCHI, Bhaskar.Discrete mathematics. 2006, Vol 306, Num 14, pp 1502-1504, issn 0012-365X, 3 p.Conference Paper

Crossing regular drawings of graphsHARBORTH, H; MENGERSEN, I.Zeitschrift für angewandte Mathematik und Mechanik. 1996, Vol 76, pp 51-54, issn 0044-2267, SUP3Conference Paper

Factorizations of regular graphs of high degreeHILTON, A. J. W.Journal of graph theory. 1986, Vol 9, Num 1, pp 193-196, issn 0364-9024Article

Regular graphs of high degree are 1-factorizableCHETWYND, A. G; HILTON, A. J. W.Proceedings of the London Mathematical Society. 1985, Vol 50, Num 2, pp 193-206, issn 0024-6115Article

Some new two-weight codes and strongly regular graphsBROUWER, A. E.Discrete applied mathematics. 1985, Vol 10, Num 1, pp 111-114, issn 0166-218XArticle

On a problem of A. Kotzig concerning factorizations of 4-regular graphsZELINKA, B.Journal of graph theory. 1984, Vol 8, Num 2, pp 325-330, issn 0364-9024Article

Regular K_n-free graphsBAUER, D.Journal of combinatorial theory. Series B. 1983, Vol 35, Num 2, pp 193-200, issn 0095-8956Article

Characterization of a class of distance regular graphsNEUMAIER, A.Journal für die reine und angewandte Mathematik. 1985, Vol 357, pp 182-192, issn 0075-4102Article

The linear arboricity of some regular graphsENOMOTO, H; PEROCHE, B.Journal of graph theory. 1984, Vol 8, Num 2, pp 309-324, issn 0364-9024Article

Every 4-regular graph plus an edge contains a 3-regular subgraphALON, N; FRIEDLAND, S; KALAI, G et al.Journal of combinatorial theory. Series B. 1984, Vol 37, Num 1, pp 92-93, issn 0095-8956Article

On smallest regular graphs with a given isopartFINK, J. F.Journal of graph theory. 1985, Vol 9, Num 1, pp 105-117, issn 0364-9024Article

The uniqueness of the strongly regular graph on 77 pointsBROUWER, A. E.Journal of graph theory. 1983, Vol 7, Num 4, pp 455-461, issn 0364-9024Article

Generating r-regular graphsGUOLI DING; CHEN, Peter.Discrete applied mathematics. 2003, Vol 129, Num 2-3, pp 329-343, issn 0166-218X, 15 p.Article

On crossing numbers of 5-regular graphsCHIA, G. L; GAN, C. S.Lecture notes in computer science. 2002, pp 230-237, issn 0302-9743, isbn 3-540-43996-X, 8 p.Conference Paper

UNICITE DES GRAPHES FORTEMENT REGULIERS DE 13 ET 17 SOMMETS.HERMANS J.1975; ACAD. R. BELG., BULL. CL. SCI.; BELG.; DA. 1975; VOL. 61; NO 7; PP. 666-674; BIBL. 2 REF.Article

THE NUMBER OF CUT VERTICES IN A REGULAR GRAPH.NIRMALA K; RAMACHANDRA RAO A.1975; CAH. CENTRE ET. RECH. OPERAT.; BELG.; DA. 1975; VOL. 17; NO 2-4; PP. 295-299; BIBL. 4 REF.; (COLLOQ. THEOR. GRAPHES; PARIS; 1974)Conference Paper

STRONGLY REGULAR GRAPHS.HUBAUT XL.1975; DISCRETE MATH.; NETHERL.; DA. 1975; VOL. 13; NO 4; PP. 357-381; BIBL. 3 P. 1/2Article

Universal traversal sequences of length nθ(^LOGn) for cliquesKARLOFF, H. J; RAMAMOHAN PATURI; SIMON, J et al.Information processing letters. 1988, Vol 28, Num 9, pp 241-243, issn 0020-0190Article

A note on the interval number of a graphERDOS, P; WEST, D. B.Discrete mathematics. 1985, Vol 55, Num 2, pp 129-133, issn 0012-365XArticle

Distance-regular graphs with girth 3 or 4:1TERWILLIGER, P.Journal of combinatorial theory. Series B. 1985, Vol 39, Num 3, pp 265-281, issn 0095-8956Article

Partitioning strongly regular graphsNODA, R.Osaka Journal of Mathematics. 1985, Vol 22, Num 2, pp 379-389, issn 0030-6126Article

GRAPHS WITH GIVEN GIRTH AND DIAMETER.BEAN DWT; SHEEHAN J.1976; IN: BR. COMB. CONF. 5. PROC.; ABERDEEN; 1975; WINNIPEG; UTILITAS MATHEMATICA; DA. 1976; PP. 11-16; BIBL. 9 REF.Conference Paper

AN ANALOGUE OF LLOYD'S THEOREM FOR COMPLETELY REGULAR CODES.HAMMOND P; SMITH DH.1976; IN: BR. COMB. CONF. 5. PROC.; ABERDEEN; 1975; WINNIPEG; UTILITAS MATHEMATICA; DA. 1976; PP. 261-267; BIBL. 13 REF.Conference Paper

Regular factors of regular graphsBOLLOBAS, B; SAITO, A; WORMALD, N. C et al.Journal of graph theory. 1985, Vol 9, Num 1, pp 97-103, issn 0364-9024Article

Regular subgraphs of dense graphsPYBER, L.Combinatorica (Print). 1985, Vol 5, Num 4, pp 347-349, issn 0209-9683Article